Перевод: с английского на русский

с русского на английский

minimal length problem

См. также в других словарях:

  • Minimal residual disease — (MRD) is the name given, to small numbers of leukaemic cells that remain in the patient during treatment, or after treatment when the patient is in remission (no symptoms or signs of disease). It is the major cause of relapse in cancer and… …   Wikipedia

  • Steiner tree problem — Steiner tree for three points A, B, and C (note there are no direct connections between A, B, C). The Steiner point S is located at the Fermat point of the triangle ABC …   Wikipedia

  • Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… …   Wikipedia

  • Two Generals' Problem — In computing, the Two Generals Problem is a thought experiment meant to illustrate the pitfalls and design challenges of attempting to coordinate an action by communicating over an unreliable link. It is related to the more general Byzantine… …   Wikipedia

  • Longest common subsequence problem — Not to be confused with longest common substring problem. The longest common subsequence (LCS) problem is to find the longest subsequence common to all sequences in a set of sequences (often just two). Note that subsequence is different from a… …   Wikipedia

  • Firing squad synchronization problem — The firing squad synchronization problem is a problem in computer science and cellular automata first proposed by John Myhill in 1957 and published (with a solution) in 1962 by Edward Moore. The problem is analogous to problems of logical design …   Wikipedia

  • isoperimetric problem — ▪ mathematics       in mathematics, the determination of the shape of the closed plane curve having a given length and enclosing the maximum area. (In the absence of any restriction on shape, the curve is a circle.) The calculus of variations… …   Universalium

  • Terminal restriction fragment length polymorphism — (TRFLP or sometimes T RFLP) is a molecular biology technique for profiling of microbial communities based on the position of a restriction site closest to a labeled end of an amplified gene. The method is based on digesting a mixture of PCR… …   Wikipedia

  • Route inspection problem — In graph theory, a branch of mathematics, the Chinese postman problem (CPP), postman tour or route inspection problem is to find a shortest closed path or circuit that visits every edge of a (connected) undirected graph. When the graph has an… …   Wikipedia

  • Bottleneck traveling salesman problem — The Bottleneck traveling salesman problem (bottleneck TSP) is a problem in discrete or combinatorial optimization. It is stated as follows: Find the Hamiltonian cycle in a weighted graph with the minimal weight of the most weighty edge of the… …   Wikipedia

  • Measurement problem — The measurement problem in quantum mechanics is the unresolved problem of how (or if) wavefunction collapse occurs. The inability to observe this process directly has given rise to different interpretations of quantum mechanics, and poses a key… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»